Extremal problems concerning Kneser graphs
نویسندگان
چکیده
منابع مشابه
Extremal problems concerning Kneser graphs
Let d and S? be two intersecting families of k-subsets of an n-element set. It is proven that l~.JuS?l <(;:i)+(;::) holds for n>f(3+,/?)k, and equality holds only if there exist two points a, b such that {a, b} n F# 0 for all FE d u g, For n=2k+o(Jj;) an example showing that in this case max 1 d u B 1 = (1 o( 1 ))( ;) is given. This disproves an old conjecture of Erdiis [7]. In the second part ...
متن کاملExtremal Graph Problems, Degenerate Extremal Problems, and Supersaturated Graphs
Notation. Given a graph, hypergraph Gn, . . . , the upper index always denotes the number of vertices, e(G), v(G) and χ(G) denote the number of edges, vertices and the chromatic number of G respectively. Given a family L of graphs, hypergraphs, ex(n,L) denotes the maximum number of edges (hyperedges) a graph (hypergraph)Gn of order n can have without containing subgraphs (subhypergraphs) from L...
متن کاملExtremal Problems for Directed Graphs
We consider directed graphs without loops and multiple edges, where the exclusion of multiple edges means that two vertices cannot be joined by two edges of the same orientation. Let L I ,. . ., LQ be given digraphs. What is the maximum number of edges a digraph can have if it does not contain any L i as a subgraph and has given number of vertices? We shall prove the existence of a sequence of ...
متن کاملExtremal problems in ordered graphs
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered graph as a subgraph. In particular, we take a step toward confirming a conjecture of Pach and Tardos [12] regarding the number of edges allowed when the forbid...
متن کاملExtremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
The main result of this paper is that for a special, but rather wide class of "sample graphs", the extremal graphs, i.e, the graphs of n vertices without subgraphs isomorphic to the sample graph and having maximum number of edges under this condition, have very simple and sYmmetric structure. This result remains valid even in the case when the' condition "the graph does not contain the sample g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1986
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90084-5